Bisimulations, Model Descriptions and Propositional Quantiiers

نویسنده

  • Albert Visser
چکیده

In this paper we give perspicuous proofs of the existence of model descriptions for nite Kripke models and of Uniform Interpolation for the theories IPC, K, GL and S4Grz, using bounded bisim-ulations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bisimulations Model Descriptions and Propositional Quanti ers

In this paper we give perspicuous proofs of the existence of model descriptions for nite Kripke models and of Uniform Interpolation for the theories IPC K GL and S Grz using bounded bisim ulations

متن کامل

Model Checking and Other Games

3 Equivalences, Modal and Temporal Logics 5 3.1 Interactive games and bisimulations . . . . . . . . . . . . . . . 7 3.2 Modal logic and bisimulations . . . . . . . . . . . . . . . . . . . 9 3.3 Temporal properties and modal mu-calculus . . . . . . . . . . 10 3.4 Second-order propositional modal logic . . . . . . . . . . . . . . 15 3.5 Fixed point and second-order games . . . . . . . . . . . . ....

متن کامل

Games with Second-order Quantiiers Which Decide Propositional Program Logics

The paper demonstrates how second-order quantiication and nite games can be exploited for deciding complicated propositional program logics like the propositional-Calculus with converse (C ?). This approach yields a new proof that C ? is in EXP T IME. Automata-theoretic technique is a very powerful and popular approach for deciding complicated propositional program logics 19, 20, 3]. The rst pa...

متن کامل

On Bisimulations for Description Logics

We formulate bisimulations for useful description logics. The simplest among the considered logics is a variant of PDL (propositional dynamic logic). The others extend that logic with inverse roles, nominals, quantified number restrictions, the universal role, and/or the concept constructor ∃r.Self. They also allow role axioms. We give results about invariance of concepts, TBoxes and ABoxes, pr...

متن کامل

Axiomatic Classes of Intuitionistic Models

A class of Kripke models for intuitionistic propositional logic is ‘axiomatic’ if it is the class of all models of some set of formulas (axioms). This paper discusses various structural characterisations of axiomatic classes in terms of closure under certain constructions, including images of bisimulations, disjoint unions, ultrapowers and ‘prime extensions’. The prime extension of a model is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996